What changes are you trying to make? (e.g. Adding or removing code, refactoring existing code, adding reports)

Check if two words are anagrams of each other.

What did you learn from the changes you have made?

Sorting has a higher time complexity than counting character frequencies for large inputs.

Was there another approach you were thinking about making? If so, what approach(es) were you thinking of?

Using a dictionary to manually count character frequencies instead of Counter.

Were there any challenges? If so, what issue(s) did you face? How did you overcome it?

Handling edge cases like empty strings, spaces, and varying letter cases. Error catching can be implemented for the solution.

How were these changes tested?

By the running the notebook in a local environment.

A reference to a related issue in your repository (if applicable)

N/A

Checklist

• I can confirm that my changes are working as intended